Underwater TDOA Acoustical Location Based on Majorization-Minimization Optimization
نویسندگان
چکیده
منابع مشابه
Composite Optimization by Nonconvex Majorization-Minimization
Many tasks in imaging can be modeled via the minimization of a nonconvex composite function. A popular class of algorithms for solving such problems are majorizationminimization techniques which iteratively approximate the composite nonconvex function by a majorizing function that is easy to minimize. Most techniques, e.g. gradient descent, utilize convex majorizers in order guarantee that the ...
متن کاملRelaxed Majorization-Minimization for Non-Smooth and Non-Convex Optimization
We propose a new majorization-minimization (MM) method for non-smooth and non-convex programs, which is general enough to include the existing MM methods. Besides the local majorization condition, we only require that the difference between the directional derivatives of the objective function and its surrogate function vanishes when the number of iterations approaches infinity, which is a very...
متن کاملParallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization
We propose an optimization framework for nonconvex problems based on majorizationminimization that is particularity well-suited for parallel computing. It reduces the optimization of a high dimensional nonconvex objective function to successive optimizations of locally tight and convex upper bounds which are additively separable into low dimensional objectives. The original problem is then brok...
متن کاملGPS/TDOA Hybrid Location Algorithm Based on Federal Kalman Filter
Generally, accuracy of GPS(Global Positioning System) is higher than that of cellular network. But in tall building urban area or indoor, relatively weak GPS signal makes the positioning unstable and inaccurate. TDOA(Time Difference of Arrival) is one of the most widely used positioning methods in cellular mobile communication systems, but its accuracy is not high enough to meet the growing dem...
متن کاملStochastic Majorization-Minimization Algorithms for Large-Scale Optimization
Majorization-minimization algorithms consist of iteratively minimizing a majorizing surrogate of an objective function. Because of its simplicity and its wide applicability, this principle has been very popular in statistics and in signal processing. In this paper, we intend to make this principle scalable. We introduce a stochastic majorization-minimization scheme which is able to deal with la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2020
ISSN: 1424-8220
DOI: 10.3390/s20164457